A symbolic decision procedure for cryptographic protocols with time stamps
نویسندگان
چکیده
We present a symbolic decision procedure for time-sensitive cryptographic protocols. We consider protocols described in a process algebra-like notation that includes clocks, time-stamps and time variables. While the values of all clocks increase with rate one when time passes, time variables are simply variables that range over the time domain and can be used to remember time-stamps, i.e. time values. Our symbolic decision procedure deals with secrecy, authentication and any property that can be described as a safety property. Our approach is based on a logic representation of sets of configurations that combines a decidable logic with time constraints. © 2004 Elsevier Inc. All rights reserved.
منابع مشابه
A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract)
We present a symbolic decision procedure for time-sensitive cryptographic protocols. We consider protocols described in a process algebra-like notation that includes clocks, time-stamps and time variables. While the values of all clocks increase with rate one when time passes, time variables are simply variables that range over the time domain and can be used to remember time-stamps, i.e. time ...
متن کاملAutomatic Verification of Time Sensitive Cryptographic Protocols
We investigate the applicability of symbolic exploration to the automatic verification of secrecy and authentication properties for time sensitive cryptographic protocols. Our formal specifications are given in multiset rewriting over first order atomic formulas enriched with constraints so as to uniformly model fresh name generation and validity condition of time stamps. Our verification appro...
متن کاملComputationally Sound Symbolic Secrecy in the Presence of Hash Functions
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it...
متن کاملUniversally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key exchange)
Symbolic analysis of cryptographic protocols is dramatically simpler than full-fledged cryptographic analysis. In particular, it is readily amenable to automation. However, symbolic analysis does not a priori carry any cryptographic soundness guarantees. Following recent work on cryptographically sound symbolic analysis, we demonstrate how Dolev-Yao style symbolic analysis can be used to assert...
متن کاملOn the Reachability Problem in Cryptographic Protocols
We study the veri cation of secrecy and authenticity properties for cryptographic protocols which rely on symmetric shared keys. The veri cation can be reduced to check whether a certain parallel program which models the protocol and the speci cation can reach an erroneous state while interacting with the environment. Assuming nite principals, we present a simple decision procedure for the reac...
متن کامل